package com.scott.BinarySearchTree;

import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.TreeSet;

public class Test {
    public static void main(String[] args) {
        BinarySearchTree<Integer> tree = new BinarySearchTree<Integer>();

        tree.insert(3);
        tree.insert(1);
        tree.insert(2);
        tree.insert(5);
        tree.insert(4);
        tree.insert(6);
        tree.insert(12);
        tree.insert(26);
        tree.insert(18);
        tree.insert(23);
        tree.insert(17);
        tree.insert(30);

        tree.preTraverse();
        System.out.println("");
        tree.inTraverse();
        System.out.println("");
        tree.postTraverse();


    }
}
